Generalized Quantifiers in Natural Language.
نویسندگان
چکیده
منابع مشابه
Deafault logic, natural language and generalized quantifiers
Default logic [Reiter 80] is now commonly used in artificial intelligence systems and turns out to be one of the major research fields in knowledge representation. One of the first motivations of default logic wan to give a more accurate semantic represem tation to natural language statements of the form: Birds fl~: Mos t birds fly. or~ arguably: Typicall2o; birds lty~ The idea was to define a ...
متن کاملGrounding natural language quantifiers in visual attention
The literature on vague quantifiers in English (words like “some”, “many”, etc.) is replete with demonstrations of context effects. Yet little attention has been paid to the issue of where such effects come from. We explore the possibility that such they emanate from a visual attentional bottleneck which limits the accuracy of judgments of number in visual scenes under conditions of time pressu...
متن کاملPrinciple-Based Interpretation of Natural Language Quantifiers
This paper describes a working prototype that determines possible relative quantifier scopes and pronoun bindings for natural language sentences, with coverage of a variety of problematic cases. The prototype parses a significant fragment of English, positing empty categories and deriving various relationships among constituents in addition to dominance. It applies cross-linguistically valid pr...
متن کاملComputational complexity of polyadic lifts of generalized quantifiers in natural language
We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide...
متن کاملGeneralized Quantifiers
We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 1987
ISSN: 0022-4812
DOI: 10.2307/2274377